Analysis of Slotted ALOHA With an Age Threshold

We present a comprehensive steady-state analysis of threshold-ALOHA, distributed age-aware modification slotted ALOHA proposed in recent literature. In each terminal suspends its transmissions until the Age Information (AoI) status update flow it is sending reaches certain threshold ?. Once age exceeds ?, attempts transmission with constant probability ? slot, as standard ALOHA. analyze time-average expected AoI attained by this policy, and explore scaling network size, n. derive distribution number active users at steady state, show that size increases policy converges to one runs fewer sources: on average about fifth any time. obtain an expression for use optimize parameters ? ?, resolving conjectures previous literature confirming optimal are 2.2n 4.69/n, respectively. find scales 1.4169n, which almost half minimum achievable ALOHA, while loss from maximum throughput e -1 remains below 1%. compare performance rudimentary algorithm SAT [2] dynamically adapts probabilities.